Indecomposable parallel maps in tessellation structures
نویسندگان
چکیده
منابع مشابه
Efficient Bounded Adaptive Tessellation of Displacement Maps
Displacement mapping is a technique for applying fine geometric detail to a simpler base surface. The displacement is often specified as a scalar function which makes it relatively easy to increase visual complexity without the difficulties inherent in more general modeling techniques. We would like to use displacement mapping in real-time applications. Ideally, a graphics accelerator should cr...
متن کاملTessellation and Lyubich-Minsky laminations associated with quadratic maps II: Topological structures of 3-laminations
We investigate topological and combinatorial structures of Lyubich and Minsky’s affine and hyperbolic 3-laminations associated with the hyperbolic and parabolic quadratic maps. We begin by showing that hyperbolic rational maps in the same hyperbolic component have quasi-isometrically the same 3-laminations. Then we describe the topological and combinatorial changes of laminations associated wit...
متن کاملCertain Relations between Properties of Maps of Tessellation Automata
In a different approach, Hedlund [4], Sears [13], and Ryan [12] defined the shift dynamical system and investigated the properties of the continuous transformations which commute with the shift transformations, and showed many interesting results in one-dimensional tessellation spaces. Hedlund conjectured that in some sense, the set A of all parallel maps which are injective on the set C of all...
متن کاملAdaptive Tessellation of Bezier Surfaces Based on Displacement Maps
Bézier surfaces are widely used in computer graphics applications. Rendering of such surfaces is commonly performed by tessellation. In order to generate less triangles for high quality surfaces, adaptive tessellation algorithms are better. The geometric tests used by these algorithms perform vector computations of high latency that decreases the performance of the algorithm. We propose an adap...
متن کاملSystem Identification using Delaunay Tessellation of Self-Organizing Maps
The Self-Organizing Map (SOM) is a vector quantization method which places prototype vectors on a regular low-dimensional grid in an ordered fashion. A new method to obtain piecewise linear models of dynamic processes is presented. The operating regimes of the local linear models are obtained by the Delaunay tessellation of the codebook of the SOM. The proposed technique is demonstrated by mean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1976
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(76)80024-4